4 found
Order:
  1.  12
    How Many Variables Does One Need to Prove PSPACE-hardness of Modal Logics.A. V. Chagrov & M. N. Rybakov - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 71-82.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  2. Modal companions of intermediate logics: A survey.A. V. Chagrov & M. V. Zakharyaschev - forthcoming - Studia Logica.
  3.  52
    Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames.A. V. Chagrov & L. A. Chagrova - 1995 - Studia Logica 55 (3):421 - 448.
    The main result is that is no effective algorithmic answer to the question:how to recognize whether arbitrary modal formula has a first-order equivalent on the class of finite frames. Besides, two known problems are solved: it is proved algorithmic undecidability of finite frame consequence between modal formulas; the difference between global and local variants of first-order definability of modal formulas on the class of transitive frames is shown.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  16
    On Halldén-completness of intermediate and modal logics.A. V. Chagrov & M. V. Zakharyashchev - 1990 - Bulletin of the Section of Logic 19 (1):21-23.
    Direct download  
     
    Export citation  
     
    Bookmark